A New Achievable Rate-Distortion Region for Distributed Source Coding

In this work, lossy distributed compression of a pair correlated sources is considered. Conventionally, Shannon's random coding arguments - using randomly generated unstructured codebooks whose blocklength taken to be asymptotically large are used derive achievability results. However, in some multi-terminal communications scenarios, codes with constant finite certain architectures leads improved achievable regions compared the conventional approach. other words, network communication there optimal value code for processing information sources. Motivated by this, scheme proposed which consists two codebook layers: i) primary has blocklength, and ii) secondary large. The performance analyzed steps. first step, characterization an inner bound region derived terms measures functions multi-letter probability distributions. next computable single-letter inner-bound extracted. It shown through example that resulting rate-distortion strictly larger than Berger-Tung region.